using greedy造句

First, find a solution using greedy algorithm.
Using greedy routing, a message is forwarded to the neighboring node which is " closest " to the destination.
Also, let d g be the cardinality of dominating set obtained using greedy approximation then following relation holds, d g d " N + 1-\ sqrt { 2M + 1 }, where N is number of nodes and M is number of edges in given undirected graph.
It's difficult to find using greedy in a sentence. 用using greedy造句挺难的